Supplementary Materials: Sympy: Symbolic Computing in Python
نویسندگان
چکیده
AARON MEURER∗, CHRISTOPHER P. SMITH† , MATEUSZ PAPROCKI‡ , ONDŘEJ ČERTÍK§ , MATTHEW ROCKLIN¶, AMIT KUMAR‖, SERGIU IVANOV#, JASON K. MOORE††, SARTAJ SINGH‡‡, THILINA RATHNAYAKE§§, SEAN VIG¶¶ , BRIAN E. GRANGER‖‖, RICHARD P. MULLER## , FRANCESCO BONAZZI1, HARSH GUPTA2, SHIVAM VATS3, FREDRIK JOHANSSON4, FABIAN PEDREGOSA5, MATTHEW J. CURRY6, ASHUTOSH SABOO7, ISURU FERNANDO8, SUMITH9, ROBERT CIMRMAN10, AND ANTHONY SCOPATZ11
منابع مشابه
SymPy: symbolic computing in Python
The supplementary material takes a deeper look at certain topics in SymPy which there was 3 not enough room to discuss in the paper. Section 1 discusses the Gruntz algorithm, used to 4 calculate limits in SymPy. Sections 2–8 discuss in depth some selected submodules. Section 9 5 discusses numerical simplification. Section 10 provides additional examples for topics discussed 6 in the main paper....
متن کاملSymPy: Symbolic computing in Python
SymPy is an open source computer algebra system written in pure Python. It 9 is built with a focus on extensibility and ease of use, through both interactive and programmatic 10 applications. These characteristics have led SymPy to become the standard symbolic library for 11 the scientific Python ecosystem. This paper presents the architecture of SymPy, a description of its 12 features, and a d...
متن کاملComputing the coefficients for the power series solution of the Lane-Emden equation with the Python library SymPy
It is shown how the Python library Sympy can be used to compute symbolically the coefficients of the power series solution of the Lane-Emden equation (LEE). Sympy is an open source Python library for symbolic mathematics. The power series solutions are compared to the numerically computed solutions using matplotlib. The results of a run time measurement of the implemented algorithm are discusse...
متن کاملSymPy: Symbolic Computing in Python
the subexpression ω (that converges to zero as x→∞ faster than all other subexpressions) is 9 identified in f(x), and f(x) is expanded into a series with respect to ω. Any positive powers 10 of ω converge to zero (while negative powers indicate an infinite limit) and any constant term 11 independent of ω determines the limit. When a constant term still dependends on x the Gruntz 12 algorithm is...
متن کاملSymbolic Quantum Circuit Simpli cation in SymPy
In the eld of quantum information science, one can design a series of quantum logic operations known as a circuit. Circuits are the basis for quantum computations in quantum computing. As circuits will most likely be designed from a logical standpoint, there could exist mathematical redundancies which will lead to a larger circuit than necessary. These redundancies are computationally expensive...
متن کامل